The Bernstein Algorithm
نویسنده
چکیده
We solve the problem of finding an enclosure for the range of a multivariate polynomial over a rectangular region by expanding the given polynomial into Bernstein polynomials. Then the coefficients of the expansion provide lower and upper bounds for the range and these bounds converge monotonically if the degree of the Bernstein polynomials is elevated. To obtain a faster improvement of the bounds we use subdivision and present an economical procedure for computing the bounds on subboxes. Then we apply the results to a problem of robust control, viz. checking the (Hurwitz) stability of a polynomial with coefficients depending polynomially on parameters varying inside given intervals. Numerical examples are also presented.
منابع مشابه
A New Iterative Method For Solving Fuzzy Integral Equations
In the present work, by applying known Bernstein polynomials and their advantageous properties, we establish an efficient iterative algorithm to approximate the numerical solution of fuzzy Fredholm integral equations of the second kind. The convergence of the proposed method is given and the numerical examples illustrate that the proposed iterative algorithm are valid.
متن کاملNumerical solution of nonlinear Hammerstein integral equations by using Legendre-Bernstein basis
In this study a numerical method is developed to solve the Hammerstein integral equations. To this end the kernel has been approximated using the leastsquares approximation schemes based on Legender-Bernstein basis. The Legender polynomials are orthogonal and these properties improve the accuracy of the approximations. Also the nonlinear unknown function has been approximated by using the Berns...
متن کاملApproximate solution of system of nonlinear Volterra integro-differential equations by using Bernstein collocation method
This paper presents a numerical matrix method based on Bernstein polynomials (BPs) for approximate the solution of a system of m-th order nonlinear Volterra integro-differential equations under initial conditions. The approach is based on operational matrices of BPs. Using the collocation points,this approach reduces the systems of Volterra integro-differential equations associated with the giv...
متن کاملNumerical resolution of large deflections in cantilever beams by Bernstein spectral method and a convolution quadrature.
The mathematical modeling of the large deflections for the cantilever beams leads to a nonlinear differential equation with the mixed boundary conditions. Different numerical methods have been implemented by various authors for such problems. In this paper, two novel numerical techniques are investigated for the numerical simulation of the problem. The first is based on a spectral method utiliz...
متن کاملOn the approximation by Chlodowsky type generalization of (p,q)-Bernstein operators
In the present article, we introduce Chlodowsky variant of $(p,q)$-Bernstein operators and compute the moments for these operators which are used in proving our main results. Further, we study some approximation properties of these new operators, which include the rate of convergence using usual modulus of continuity and also the rate of convergence when the function $f$ belongs to the class Li...
متن کاملExpansion methods for solving integral equations with multiple time lags using Bernstein polynomial of the second kind
In this paper, the Bernstein polynomials are used to approximate the solutions of linear integral equations with multiple time lags (IEMTL) through expansion methods (collocation method, partition method, Galerkin method). The method is discussed in detail and illustrated by solving some numerical examples. Comparison between the exact and approximated results obtained from these methods is car...
متن کامل